Introduction to Decimal Sequences
نویسنده
چکیده
A decimal sequence is obtained when a number is represented in a decimal form in a base r and it may terminate, repeat or be aperiodic. For a certain class of decimal sequences of q 1 , prime, the digits spaced half a period apart add up to q 1 − r , where r is the base in which the sequence is expressed. Decimal sequences are known to have good crossand auto-correlation properties and they can be used in applications involving pseudorandom sequences. The following section describes the properties of decimal sequences [1,2]:
منابع مشابه
Improved Watermarking Scheme Using Decimal Sequences
This thesis improves upon the work carried out by Mandhani on decimal sequence watermarking showing that the embedding and decoding algorithms used by Mandhani are not robust. We next specify improvements to these algorithms so that the peak signal to noise ratio (PSNR) is maximized and the distortion introduced in the image due to the embedding is minimized. By exploiting the cross correlation...
متن کاملMinimal Surfaces Associated with Nonpolynomial Contact Symmetries
Two infinite sequences of minimal surfaces in space are constructed using symmetry analysis. In particular, explicit formulas are obtained for the selfintersecting minimal surface that fills the trefoil knot. UDC 514.763.85, 517.972.6 Introduction. In this paper we consider the Euler–Lagrange minimal surface equation
متن کاملWatermarking Using Decimal Sequences
This paper introduces the use of decimal sequences in a code division multiple access (CDMA) based watermarking system to hide information for authentication in black and white images. Matlab version 6.5 was used to implement the algorithms discussed in this paper. The advantage of using d-sequences over PN sequences is that one can choose from a variety of prime numbers which provides a more f...
متن کاملThe binary primes sequence for computational hardening of pseudorandom sequences
This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the ...
متن کاملNew Class of Pseudorandom D-sequences to Generate Cryptographic Keys
This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys. These sequences are generated by starting with inverse prime expansions in base 3 and then replacing 2 in the expansion with either the string 01 or 10 based on the preceding bit, which represents a general mapping. We show that the resulting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006